Binary Optimization
نویسنده
چکیده
In this lecture, we will discuss one of the most important applications of semidefinite programming, namely its use in the formulation of convex relaxations of nonconvex optimization problems. We will present the results from several different, but complementary, points of view. These will also serve us as starting points for the generalizations to be presented later in the course. We will discuss first the case of binary quadratic optimization, since in this case the notation is simpler, and perfectly illustrates many of the issues appearing in more complicated problems. Afterwards, a more general formulation containing arbitrary linear and quadratic constraints will be presented.
منابع مشابه
A particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملFORCED WATER MAIN DESIGN MIXED ANT COLONY OPTIMIZATION
Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...
متن کاملTOPOLOGY OPTIMIZATION OF PLANE STRUCTURES USING BINARY LEVEL SET METHOD AND ISOGEOMETRIC ANALYSIS
This paper presents the topology optimization of plane structures using a binary level set (BLS) approach and isogeometric analysis (IGA). In the standard level set method, the domain boundary is descripted as an isocountour of a scalar function of a higher dimensionality. The evolution of this boundary is governed by Hamilton–Jacobi equation. In the BLS method, the interfaces of subdomai...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملImproved Binary Particle Swarm Optimization Based TNEP Considering Network Losses, Voltage Level, and Uncertainty in Demand
Transmission network expansion planning (TNEP) is an important component of power system planning. Itdetermines the characteristics and performance of the future electric power network and influences the powersystem operation directly. Different methods have been proposed for the solution of the static transmissionnetwork expansion planning (STNEP) problem till now. But in all of them, STNEP pr...
متن کامل